Pattern matching in concatenative programming languages
نویسنده
چکیده
Pattern matching is a useful, convenient tool for processing algebraic data types in functional programming languages. This paper discusses a method for porting pattern matching to a family of programming languages called concatenative, which does not use named variables. The system is not fixed, like a traditional pattern matching system, but rather arbitrarily extensible: any function can be used as a pattern if the right information is given to the pattern matcher. This generalization of pattern matching has been useful in libraries for XML processing and unit conversion.
منابع مشابه
Translation of Pattern Matching in a Java-like Language
Patternmatching is a programming language construct that is common in functional programming but somewhat less popular in object-oriented languages. The present paper gives an overview of issues that arise when adding pattern matching to an object-oriented language like Java.
متن کاملBasic Pattern Matching Calculi: Syntax, Reduction, Confluence, and Normalisation
The pattern matching calculus is a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. In comparison with the functional rewriting strategy that is usually employed to define the operational semantics of pattern-matching in non-strict functional programming languages like Haskell or Clean, the pattern matching calculus allow...
متن کاملAdding Pattern Matching to Existing Object-Oriented Languages
While object-oriented languages are designed for information hiding and data encapsulation, intensive data manipulation often calls for pattern matching, one of the main features of functional programming languages. Pattern matching provides a concise way to describe specific structures or conditions of objects so that programmers can clearly identify and easily access the corresponding objects...
متن کاملPattern Matching via Choice Existential Quantifications in Imperative Languages
Selection statements – if-then-else, switch and try-catch – are commonly used in modern imperative programming languages. We propose another selection statement called a choice existentially quantified statement. This statement turns out to be quite useful for pattern matching among several merits. Examples will be provided for this statement. keywords: selection, pattern matching, choice quant...
متن کاملOn Pattern-Based Programming towards the Discovery of Frequent Patterns
The problem of frequent pattern discovery is defined as the process of searching for patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns has become an important data mining task because it reveals associations, correlations, and many other interesting relationships hidden in a database. Most of the proposed frequent pattern mining algorithms...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009